Amalgamating Language and Meta-language for Composing Logic Programs
نویسندگان
چکیده
Logic programming is extended with expressions of the form A in Pexp both in top-level goals and in clause bodies. A in Pexp is a meta-level feature that denotes the truth of a formula A with respect to a \virtual" set of clauses denoted by the program expression Pexp. Pexp involves named collections of clauses and composition operations over them. Both the operational and xpoint semantics of the language are given along with its meta-level deenition. A set of examples provides evidence of expressiveness of the language.
منابع مشابه
Meta-programming with Concrete Object Syntax
Meta programs manipulate structured representations, i.e., abstract syntax trees, of programs. The conceptual distance between the concrete syntax meta-programmers use to reason about programs and the notation for abstract syntax manipulation provided by general purpose (meta-) programming languages is too great for many applications. In this paper it is shown how the syntax definition formalis...
متن کاملA Visual System for Compositional Relational Programming
Combilog is a compositional relational programming language that allows writing relational logic programs by functionally composing relational predicates. Higraphs, a diagram formalism is consulted to simplify some of the textual complexity of compositional relational programming to achieve a visual system that can represent these declarative meta-programs, with the final intention to design an...
متن کاملAmalgamating Multiple Programming Paradigms in PROLOG
This paper discusses the issues in amalgamating multiple programming paradigms in the logic programming language, Prolog. It is shown that multiple paradigms can be incorporated without disturbing logic programming language features and efficiency. It also introduces a new programming paradigm called the relation-oriented paradigm. The research results are reflected in the implementation of the...
متن کاملAmalgamating NAF and NAI
We deene a new logic language with negation by introducing existential and universal quantiiers in the queries. We call ??general programs and ??general goals the programs and the goals in this language. Negation is handled by using two rules: the NAF rule for universally quantiied negative queries and the NAI rule for existentially quantiied negative queries. We formalize this amalgamation in ...
متن کاملStrategies for the Efficient Solution of Hybrid Constraint Logic Programs
Meta-S is a system for defining the cooperation and coordination of constraint solvers to attack hybrid constraint problems. The integration of a logic programming language into this system by considering the language evaluation mechanism resolution as constraint solver yields a CLP language with support for solver cooperation. Using the strategy definition framework of Meta-S we define classic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994